The Box Graph in Superstring Theory †
نویسنده
چکیده
In theories of closed oriented superstrings, the one loop amplitude is given by a single diagram, with the topology of a torus. Its interpretation had remained obscure, because it was formally real, converged only for purely imaginary values of the Mandelstam variables, and had to account for the singularities of both the box graph and the one particle reducible graphs in field theories. We present in detail an analytic continuation method which resolves all these difficulties. It is based on a reduction to certain minimal amplitudes which can themselves be expressed in terms of double and single dispersion relations, with explicit spectral densities. The minimal amplitudes correspond formally to an infinite superposition of box graphs on φ 3 like field theories, whose divergence is responsible for the poles in the string amplitudes. This paper is a considerable simplification and generalization of our earlier proposal published in Phys.
منابع مشابه
THE (△,□)-EDGE GRAPH G△,□ OF A GRAPH G
To a simple graph $G=(V,E)$, we correspond a simple graph $G_{triangle,square}$ whose vertex set is ${{x,y}: x,yin V}$ and two vertices ${x,y},{z,w}in G_{triangle,square}$ are adjacent if and only if ${x,z},{x,w},{y,z},{y,w}in Vcup E$. The graph $G_{triangle,square}$ is called the $(triangle,square)$-edge graph of the graph $G$. In this paper, our ultimate goal is to provide a link between the ...
متن کاملAnalysis of Resting-State fMRI Topological Graph Theory Properties in Methamphetamine Drug Users Applying Box-Counting Fractal Dimension
Introduction: Graph theoretical analysis of functional Magnetic Resonance Imaging (fMRI) data has provided new measures of mapping human brain in vivo. Of all methods to measure the functional connectivity between regions, Linear Correlation (LC) calculation of activity time series of the brain regions as a linear measure is considered the most ubiquitous one. The strength of the dependence obl...
متن کاملMORE ON EDGE HYPER WIENER INDEX OF GRAPHS
Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge set E(G). The (first) edge-hyper Wiener index of the graph G is defined as: $$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$ where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). In thi...
متن کاملSimple groups with the same prime graph as $D_n(q)$
Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...
متن کاملSupersymmetric Wilson Loops in IIB Matrix Model
We show that the supersymmetric Wilson loops in IIB matrix model give a transition from supersymmetric Yang-Mills theory to supersymmetric space-time theory. In comparison with Green-Schwarz superstring we identify the supersymmetric Wilson loops with the asymptotic states of IIB superstring. It is pointed out that the supersymmetry transformation law of the Wilson loops is the inverse of that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994